Vector fuzzy C-means

نویسندگان

  • Hadi Mahdipour Hossein-Abad
  • Morteza Khademi
  • Hadi Sadoghi Yazdi
چکیده

Many variants of fuzzy c-means (FCM) clustering method are applied to crisp numbers but only a few of them are extended to non-crisp numbers, mainly due to the fact that the latter needs complicated equations and exhausting calculations. Vector form of fuzzy c-means (VFCM), proposed in this paper, simplifies the FCM clustering method applying to non-crisp (symbolic interval and fuzzy) numbers. Indeed, the VFCM method is a simple and general form of FCM that applies the FCM clustering method to various types of numbers (crisp and non-crisp) with different correspondent metrics in a single structure, and without any complex calculations and exhaustive derivations. The VFCM maps the input (crisp or non-crisp) features to crisp ones and then applies the conventional FCM to the input numbers in the resulted crisp features' space. Finally, the resulted crisp prototypes in the mapped space would be influenced by inverse mapping to obtain the main prototypes' parameters in the input features' space. Equations of FCM applied to crisp, symbolic interval and fuzzy numbers (i.e., LR-type, trapezoidal-type, triangular-type and normal-type fuzzy numbers) are obtained in this paper, using the proposed VFCM method. Final resulted equations are the same as (the FCM clustering method applying to non-crisp numbers directly and without using VFCM), while the VFCM obtains these equations using a single structure for all cases [7, 9, 10, 13, 18, 19, 30, 38–40] without any complex calculations. It is showed that VFCM is able to clustering of normal-type fuzzy numbers, too. Simulation results approve truly of normal-type fuzzy numbers clustering.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An integrated approach to fuzzy learning vector quantization and fuzzy c-means clustering

This letter derives a new interpretation for a family of competitive learning algorithms and investigates their relationship to fuzzy c-means and fuzzy learning vector quantization. These algorithms map a set of feature vectors into a set of prototypes associated with a competitive network that performs unsupervised learning. Derivation of the new algorithms is accomplished by minimizing an ave...

متن کامل

Kernel-based fuzzy and possibilistic c-means clustering

The 'kernel method' has attracted great attention with the development of support vector machine (SVM) and has been studied in a general way. In this paper, this 'method' is extended to the well-known fuzzy c-means (FCM) and possibilistic c-means (PCM) algorithms. It is realized by substitution of a kernel-induced distance metric for the original Euclidean distance, and the corresponding algori...

متن کامل

Dependence of Two Different Fuzzy Clustering Techniques on Random Initialization and a Comparison

In the recent past Kernelized Fuzzy C-Means clustering technique has earned popularity especially in the machine learning community. This technique has been derived from the conventional Fuzzy C-Means clustering technique of Bezdek by defining the vector norm with the Gaussian Radial Basic Function instead of a Euclidean distance. Subsequently the fuzzy cluster centroids and the partition matri...

متن کامل

On Tolerant Fuzzy c-Means Clustering with L1-Regularization

We have proposed tolerant fuzzy c-means clustering (TFCM) from the viewpoint of handling data more flexibly. This paper presents a new type of tolerant fuzzy c-means clustering with L1-regularization. L1-regularization is wellknown as the most successful techniques to induce sparseness. The proposed algorithm is different from the viewpoint of the sparseness for tolerance vector. In the origina...

متن کامل

A Noise-Resistant Fuzzy C Means Algorithm for Clustering - Fuzzy Systems Proceedings, 1998. IEEE World Congress on Computational Intelligence., The 1998 IEEE

Probabilistic clustering techniques use the concept of memberships to describe the degree by which a vector belongs to a cluster. The use of memberships provides probabilistic methods with more realistic clustering than “hard” techniques. However, fuzzy schemes (like the Fuzzy c Means algorithm, FCW are open sensitive to outliers. We review four existing algorithms, devised to reduce this sensi...

متن کامل

Fuzzy Clustering Approach Using Data Fusion Theory and its Application To Automatic Isolated Word Recognition

 In this paper, utilization of clustering algorithms for data fusion in decision level is proposed. The results of automatic isolated word recognition, which are derived from speech spectrograph and Linear Predictive Coding (LPC) analysis, are combined with each other by using fuzzy clustering algorithms, especially fuzzy k-means and fuzzy vector quantization. Experimental results show that the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Journal of Intelligent and Fuzzy Systems

دوره 24  شماره 

صفحات  -

تاریخ انتشار 2013